typedef struct llist_node{
	void *data;
	struct llist_node *next;
}l_node;

l_node *insert_list( l_node *head, void *data )
{
	l_node *new_node = (l_node*) malloc( sizeof(l_node) );
	new_node->data = data;
	new_node->next = NULL;
	
	if( head == NULL ){
		return new_node;
	}
	else{
		new_node->next = head;
		return new_node;
	}
}

l_node *delete_list( l_node *head )
{
	l_node *second = head->next;
	free(head);
	return second;
}
